Constraint satisfaction techniques in planning and scheduling
نویسندگان
چکیده
منابع مشابه
Constraint satisfaction techniques in planning and scheduling
Over the last few years constraint satisfaction, planning, and scheduling have received increased attention, and substantial effort has been invested in exploiting constraint satisfaction techniques when solving real life planning and scheduling problems. Constraint satisfaction is the process of finding a solution to a set of constraints. Planning is the process of finding a sequence of action...
متن کاملIntroduction to planning, scheduling and constraint satisfaction
Planning, scheduling and constraint satisfaction are important areas in Artificial Intelligence (AI). Many real-world problems are known as AI planning and scheduling problems, where resources must be allocated so as to optimize overall performance objectives. Therefore, solving these problems requires an adequate mixture of planning, scheduling and resource allocation to competing goal activit...
متن کاملProbabilistic Planning with Constraint Satisfaction techniques
Our research’s aim is to explore the use of constraint satisfaction techniques in probabilistic planning. We first focus on two special cases that make different assumptions on the observability of the domain: the conformant probabilistic planning problem (CfPP), where the agent’s environment is not observable, and the contingent probabilistic planning problem (CtPP), where the environment is f...
متن کاملNew trends in constraint satisfaction, planning, and scheduling: a survey
During recent years the development of new techniques for constraint satisfaction, planning, and scheduling has received increased attention, and substantial effort has been invested in trying to exploit such techniques to find solutions to real life problems. In this paper, we present a survey on constraint satisfaction, planning and scheduling from the Artificial Intelligence point of view. I...
متن کاملProceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems ( COPLAS - 15 )
RANTANPLAN is a numeric planning solver that takes advantage of recent advances in SMT. It extends reduction to SAT approaches with an easy and efficient handling of numeric fluents using background theories. In this paper we describe the design choices and features of RANTANPLAN, especially, how numeric reasoning is integrated in the system. We also provide experimental results showing that RA...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Manufacturing
سال: 2008
ISSN: 0956-5515,1572-8145
DOI: 10.1007/s10845-008-0203-4